Recognizing Greedy Structures
نویسندگان
چکیده
We study decision problems of the following form: Given an instance of a combinatorial problem, can it be solved by a greedy algorithm? We present algorithms for the recognition of greedy instances of certain problems, structural characterization of such instances for other problems, and proofs of NP-hardness of the recognition problem for some other cases. Previous results of this type are also stated and reviewed. Q 1996 Academic Press, Inc.
منابع مشابه
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP
For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of r, where r is a xed rational number. Our main results are that these problems are complete for the class of problems solvable via parallel access to NP. To achieve th...
متن کاملTree Edit Models for Recognizing Textual Entailments, Paraphrases, and Answers to Questions
We describe tree edit models for representing sequences of tree transformations involving complex reordering phenomena and demonstrate that they offer a simple, intuitive, and effective method for modeling pairs of semantically related sentences. To efficiently extract sequences of edits, we employ a tree kernel as a heuristic in a greedy search routine. We describe a logistic regression model ...
متن کاملAn Exact Characterization of Greedy Structures
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the partial characterizations of Rado, Gale, and Edmonds (matroids), and of Korte and Lovasz (greedoids). We show that the greedy algorithm optimizes all linear objective functions if and only if the problem structure (phrase...
متن کاملPerformance analysis of greedy fast-shift block acknowledgement for high-throughput WLANs
The techniques of frame aggregation and block acknowledgement (ACK) are utilized in the IEEE 802.11n standard for achieving high throughput performance from the medium access control perspective. Conventional greedy scheme for block ACK adopts the transmitterdefined starting sequence number (SSN) to construct the ACK window for recognizing the correctness of data packets. However, there exists ...
متن کاملNeighbor Systems and the Greedy Algorithm ( Extended
A neighbor system, introduced in this paper, is a collection of integral vectors in R with some special structure. Such collections (slightly) generalize jump systems, which, in turn, generalize integral bisubmodular polyhedra, integral polymatroids, delta-matroids, matroids, and other structures. We show that neighbor systems provide a systematic and simple way to characterize these structures...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 20 شماره
صفحات -
تاریخ انتشار 1996